SAT-Based Area Recovery in Technology Mapping
نویسندگان
چکیده
This paper proposes a new SAT-based algorithm for recovering area in technology mapping. The algorithm considers a sequence of relatively small overlapping regions of a mapped network and computes an improved mapping of each using a SAT solver. Delay constraints are taken into account by interfacing the SAT solver with a timer. Experimental results are given for mapping into 6LUTs. An average reduction in area on top of a high-effort area-only synthesis/mapping flow was 3-4% while for some benchmarks the area reduction was more than 10%.
منابع مشابه
Mapping and Resynthesis for LUT-based FPGAs with an Efficient SAT-Based Boolean Matching
To support FPGA synthesis in the OAGear package, we have implemented the following new components: (i) a cut-based technology mapper for LUT-based FPGA with delay/area optimization options, (ii) an efficient SAT-based Boolean matcher (SAT-BM) for both single-output and multipleoutput Boolean functions, and (iii) an area-aware resynthesis algorithm using this SAT-BM. The SAT-BM incorporates the ...
متن کاملA GIS-based weights-of-evidence model for mineral potential mapping of hydrothermal gold deposits in Torbat-e-Heydarieh area
The method of weights of evidence is one of the most important data driven methods for mineral potential mapping in GIS. In this method, considering the characteristics of known mineralized locations, we can prospect new mineralized areas. In this research work, the method of weights of evidence has been used for hydrothermal gold potential mapping in Torbat-e-Heydarieh area, east of Iran. As a...
متن کاملPost-mapping topology rewriting for FPGA area minimization
Circuit designers require Computer-Aided Design (CAD) tools when compiling designs into Field Programmable Gate Arrays (FPGAs) in order to achieve high quality results due to the complexity of the compilation tasks involved. Technology mapping is one critical step in the FPGA CAD flow. The final mapping result has significant impact on the subsequent steps of clustering, placement and routing, ...
متن کاملAccelerating Boolean Matching Using Bloom Filter
Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing precalculated matching results. To show the effectiveness of the pr...
متن کاملSAT-Based Logic Optimization and Resynthesis
The paper develops a technology-independent optimization and post-mapping resynthesis for combinational logic networks, with emphasis on scalability and optimizing power. The proposed resynthesis (a) is capable of substantial logic restructuring, (b) is customizable to solve a variety of optimization tasks, and (c) has reasonable runtime on large industrial designs. The approach is based on sev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017